A construction of MDS 2D convolutional codes of rate 1/n based on superregular matrices
نویسندگان
چکیده
In this paper two-dimensional convolutional codes with finite support are considered, i.e., convolutional codes whose codewords have compact support indexed in N and take values in F, where F is a finite field. The main goal of this work is to analyze the (free) distance properties of this type of codes of rate 1/n and degree δ. We first establish an upper bound on the maximum possible distance for these codes. We then present particular constructions of two-dimensional convolutional codes with finite support of rate 1/n and degree δ that attain such a bound and therefore have the maximum distance among all two-dimensional convolutional codes with finite support with the same rate and degree. We call such codes maximum distance separable two-dimensional convolutional codes.
منابع مشابه
From 1D Convolutional Codes to 2D Convolutional Codes of Rate 1/n
In this paper we introduce a new type of superregular matrices that give rise to novel constructions of two-dimensional (2D) convolutional codes with finite support. These codes are of rate 1/n and degree δ with n ≥ δ + 1 and achieve the maximum possible distance among all 2D convolutional codes with finite support with the same parameters.
متن کاملA new class of superregular matrices and MDP convolutional codes
This paper deals with the problem of constructing superregular matrices that lead to MDP convolutional codes. These matrices are a type of lower block triangular Toeplitz matrices with the property that all the square submatrices that can possibly be nonsingular due to the lower block triangular structure are nonsingular. We present a new class of matrices that are superregular over a sufficien...
متن کاملSuperregular Matrices and the Construction of Convolutional Codes having a Maximum Distance Profile
Superregular matrices are a class of lower triangular Toeplitz matrices that arise in the context of constructing convolutional codes having a maximum distance profile. These matrices are characterized by the property that no submatrix has a zero determinant unless it is trivially zero due to the lower triangular structure. In this paper, we discuss how superregular matrices may be used to cons...
متن کاملOn superregular matrices and MDP convolutional codes
Superregular matrices are a type of lower triangular Toeplitz matrix that arises in the context of constructing convolutional codes having a maximum distance profile. These matrices are characterized by the property that the only submatrices having a zero determinant are those whose determinants are trivially zero due to the lower triangular structure. In this paper, we discuss how superregular...
متن کاملSuperregular matrices and applications to convolutional codes
The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a × b, a ≥ b, superregular matrix over a field, we show that if all of its rows are nonzero then any linear combination of its columns, with nonzero coefficients, has at least a − b + 1 nonzero entrie...
متن کامل